k-Path-Connectivity of Completely Balanced Tripartite Graphs
نویسندگان
چکیده
For a graph G=(V,E) and set S?V(G) of size at least 2, path in G is said to be an S-path if it connects all vertices S. Two S-paths P1 P2 are internally disjoint E(P1)?E(P2)=? V(P1)?V(P2)=S; that is, they share no edges apart from Let ?G(S) denote the maximum number G. The k-path-connectivity ?k(G) then defined as minimum ?G(S), where S ranges over k-subsets V(G). In this paper, we study complete balanced tripartite Kn,n,n obtain ?kKn,n,n=2nk?1 for 3?k?n.
منابع مشابه
Connectivity of path graphs
We prove a necessary and sufficient condition under which a connected graph has a connected P3-path graph. Moreover, an analogous condition for connectivity of the Pk-path graph of a connected graph which does not contain a cycle of length smaller than k+1 is derived.
متن کاملA Note on Chromatic Uniqueness of Completely Tripartite Graphs
Let P (G,λ) be the chromatic polynomial of a simple graph G. A graph G is chromatically unique if for any simple graph H, P (H,λ) = P (G,λ) implies that H is isomorphic to G. Many sufficient conditions guaranteeing that some certain complete tripartite graphs are chromatically unique were obtained by many scholars. Especially, in 2003, Zou Hui-wen showed that if n > 1 3 m+ 1 3 k+ 1 3 mk+ 1 3 m−...
متن کاملCrossing numbers of complete tripartite and balanced complete multipartite graphs
The crossing number cr(G) of a graph G is the minimum number of crossings in a nondegenerate planar drawing of G. The rectilinear crossing number cr(G) of G is the minimum number of crossings in a rectilinear nondegenerate planar drawing (with edges as straight line segments) of G. Zarankiewicz proved in 1952 that cr(Kn1,n2) ≤ Z(n1, n2) := ⌊ n1 2 ⌋ ⌊ n1−1 2 ⌋ ⌊ n2 2 ⌋ ⌊ n2−1 2 ⌋ . We define an ...
متن کاملRecognizing k-path Graphs
The k-path graph Pk(H) of a graph H has all length-k paths of H as vertices; two such vertices are adjacent in the new graph if their union forms a path or cycle of length k + 1 in H , and if the common edges of both paths form a path of length k − 1. In this paper we give a (nonpolynomial) recognition algorithm for k-path graphs, for every integer k¿2. The algorithm runs in polynomial time if ...
متن کاملChromaticity of certain tripartite graphs identified with a path
For a graphG, let P(G) be its chromatic polynomial. Two graphsG andH are chromatically equivalent if P(G)=P(H). A graph G is chromatically unique if P(H)= P(G) implies that H G. In this paper, we classify the chromatic classes of graphs obtained from K2,2,2 ∪ Pm(m 3), (K2,2,2 − e) ∪ Pm(m 5) and (K2,2,2 − 2e) ∪ Pm(m 6) by identifying the end-vertices of the path Pm with any two vertices of K2,2,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Axioms
سال: 2022
ISSN: ['2075-1680']
DOI: https://doi.org/10.3390/axioms11060270